Open and Closed World Reasoning in the Semantic Web
نویسندگان
چکیده
In this paper general mechanisms and syntactic restrictions are explored in order to specify and merge rule bases in the Semantic Web. Rule bases are expressed by extended logic programs having two forms of negation, namely strong (or explicit) and weak (also known as default negation or “negation as failure”). The proposed mechanisms are defined by very simple modular program transformations, and integrate both open and closed world reasoning. These program transformations are shown to be appropriate for the two major semantics for extended logic programs: answer set semantics and wellfounded semantics with explicit negation. Moreover, the results obtained by both semantics are compared.
منابع مشابه
Closed World Reasoning in the Semantic Web through Epistemic Operators
The open world assumption makes OWL principally suitable to handle incomplete knowledge in Semantic Web scenarios, however, some scenarios desire closed world reasoning. Autoepistemic description logics allow to realise closed world reasoning in open world settings through epistemic operators. An extension of OWL by epistemic operators therefore allows for non-monotonic features known from clos...
متن کاملMatching Semantic Service Descriptions with Local Closed-World Reasoning
Semantic Web Services were developed with the goal of automating the integration of business processes on the Web. The main idea is to express the functionality of the services explicitly, using semantic annotations. Such annotations can, for example, be used for service discovery—the task of locating a service capable of fulfilling a business request. In this paper, we present a framework for ...
متن کاملLogic Programs with Contextually Scoped Negation
The Semantic Web community is currently dominated by knowledge representation formalisms adhering to a strict open world assumption. Nonmonotonic reasoning formalisms are viewed with partial scepticism and it is often argued that nonmonotonic reasoning techniques which adopt a closed world assumption are invalid in an open environment such as the Web where knowledge is notoriously incomplete. N...
متن کاملSemantic and Computational Advantages of the Safe Integration of Ontologies and Rules
Description Logics (DLs) are playing a central role in ontologies and in the Semantic Web, since they are currently the most used formalisms for building ontologies. Both semantic and computational issues arise when extending DLs with rule-based components. In particular, integrating DLs with nonmonotonic rules requires to properly deal with two semantic discrepancies: (a) DLs are based on the ...
متن کاملPlanning for Semantic Web Services
Using Semantic Web ontologies to describe Web Services has proven to be useful for various different tasks including service discovery and composition. AI planning techniques have been employed to automate the composition of Web Services described this way. Planners use the description of the preconditions and effects of a service to do various sorts of reasoning about how to combine services i...
متن کامل